A recovery algorithm for chain graphs

نویسنده

  • Milan Studený
چکیده

The class of chain graphs (CGs) involving both undirected graphs (=Markov networks) and directed acyclic graphs (= Bayesian networks) was introduced in middle eighties for description of probabilistic conditional independence structures. Every class of Markov equivalent CGs (that is, CGs describing the same conditional independence structure) has a natural representative, which is called the largest CG. The paper presents a recovery algorithm, which on the basis of the conditional independence structure given by a CG (in the form of a dependency model) finds the largest CG representing the corresponding class of Markov equivalent CGs. As a by-product a graphical characterization of graphs which are the largest CGs (for a class of Markov equivalent CGs) is obtained, and a simple algorithm changing every CG into the largest CG of the corresponding equivalence class is given. © 1997 Elsevier Science Inc. K E Y W O R D S : chain graph, dependency model, Markov equivalence, pattern, largest chain graph, recovery algorithm 1. I N T R O D U C T I O N Classical graphical approaches to the description of probabilistic conditional independence structures use either undirected graphs (UGs), also called Markov networks, or directed acyclic graphs (DAGs), known as Bayesian networks or (probabilistic) influence diagrams. In middle eighties Lauritzen and Wermuth [12] introduced the class of chain graphs (CGs), which includes both UGs and DAGs, but not only them. In CGs both undirected edges, called lines, and directed edges, called arrows, are Address correspondence to Milan Studenf,, Institute of Information Theory and Automation, Academy of Sciences of the Czech Republic, Pod voddrenskou vY~[ 4, 182 08 Prague, Czech Republic. E-mail: [email protected], cz. Received 1 December 1996; accepted 1 December 1996. International Journal of Approximate Reasoning 1997; 17:265-293 © 1997 Elsevier Science Inc. 0888-613X/97/$17.00 655 Avenue of the Americas, New York, NY 10010 PII S0888-613X(97)00018-2

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Recovery Algorithm for Chain Graphs

The class of chain graphs (CGs) involving both undirected graphs (= Markov networks) and directed acyclic graphs (= Bayesian networks) was introduced in middle eighties for description of probabilistic conditional independence structures. Every class of Markov equivalent CGs (that is CGs describing the same conditional independence structure) has a natural representative, which is called the la...

متن کامل

META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

متن کامل

A particle swarm optimization algorithm for minimization analysis of cost-sensitive attack graphs

To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider cost-sensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. There may be multiple countermeasures with different weights for preventing a single exploit. Also,...

متن کامل

An Integer Programming Model and a Tabu Search Algorithm to Generate α-labeling of Special Classes of Quadratic Graphs

First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...

متن کامل

Structural Learning of Chain Graphs via Decomposition.

Chain graphs present a broad class of graphical models for description of conditional independence structures, including both Markov networks and Bayesian networks as special cases. In this paper, we propose a computationally feasible method for the structural learning of chain graphs based on the idea of decomposing the learning problem into a set of smaller scale problems on its decomposed su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Approx. Reasoning

دوره 17  شماره 

صفحات  -

تاریخ انتشار 1997